THE CLASS NUMBER OF Q ( √ − p ) AND DIGITS OF 1
نویسنده
چکیده
Let p be a prime number such that p ≡ 1 (mod r) for some integer r > 1. Let g > 1 be an integer such that g has order r in (Z/pZ)∗. Let 1 p = ∞ ∑ k=1 xk gk be the g-adic expansion. Our result implies that the “average” digit in the g-adic expansion of 1/p is (g − 1)/2 with error term involving the generalized Bernoulli numbers B1,χ (where χ is a character modulo p of order r with χ(−1) = −1). Also, we study, using Bernoulli polynomials and Dirichlet Lfunctions, the set equidistribution modulo 1 of the elements of the subgroup Hn of (Z/nZ) ∗ as n → ∞ whenever |Hn|/ √ n → ∞.
منابع مشابه
The sum of digits of primes in Z[i]
We study the distribution of the complex sum-of-digits function sq with basis q = −a ± i, a ∈ Z+ for Gaussian primes p. Inspired by a recent result of Mauduit and Rivat [16] for the real sum-of-digits function, we here get uniform distribution modulo 1 of the sequence (αsq(p)) provided α ∈ R \Q and q is prime with a ≥ 28. We also determine the order of magnitude of the number of Gaussian primes...
متن کاملArteriographic Evaluation of Laminitis Digits in the Hind Limbs of Dairy Cattle
Objective: Laminitis is one of the main causes of lameness in dairy cattle. In this situation the corium blood circulation is disrupted and the production of healthy horny hoof wall is reduced. The purpose of this study was to evaluate the arteriographic pattern of the digital arterial branches in the laminitic digits and to compare them with the normal digits. Design: Original study. Animals...
متن کاملON THE JOINT DISTRIBUTION OF q-ADDITIVE FUNCTIONS ON POLYNOMIAL SEQUENCES
The joint distribution of sequences (f`(P`(n)))n∈N, ` = 1, 2, . . . , d and (f`(P`(p)))p∈P respectively, where f` are q`-additive functions and P` polynomials with integer coefficients, is considered. A central limit theorem is proved for a larger class of q` and P` than by Drmota [3]. In particular, the joint limit distribution of the sum-of-digits functions sq1 (n), sq2 (n) is obtained for ar...
متن کاملThe sum-of-digits function of polynomial sequences
Let q ≥ 2 be an integer and sq(n) denote the sum of the digits in base q of the positive integer n. The goal of this work is to study a problem of Gelfond concerning the repartition of the sequence (sq(P (n)))n∈N in arithmetic progressions when P ∈ Z[X] is such that P (N) ⊂ N. We answer Gelfond’s question and we show the uniform distribution modulo 1 of the sequence (αsq(P (n)))n∈N for α ∈ R \Q...
متن کامل8 Minimal Niven numbers
Define a k to be the smallest positive multiple of k such that the sum of its digits in base q is equal to k. The asymptotic behavior, lower and upper bound estimates of a k are investigated. A characterization of the minimality condition is also considered. A positive integer n is a Niven number (or a Harshad number) if it is divisible by the sum of its (decimal) digits. For instance, 2007 is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010